Approximating Min - sum Set Cover 1 Uriel
نویسندگان
چکیده
منابع مشابه
Approximating Minimum Linear Ordering Problems
This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...
متن کاملImproved Approximation for Min-Sum Vertex Cover
The paper describes an approximation algorithm for the Min Sum Vertex Cover (MSVC) problem, achieving a constant approximation factor strictly smaller than 2, thus improving on the best currently known approximation algorithm for the problem. ∗Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel. E-mail: [email protected]. †Depar...
متن کاملMin-Sum Set Cover and Its Generalizations
Min Sum Set Cover and its Generalizations Name: Sungjin Im Affil./Addr. Electrical Engineering and Computer Science, University of California, Merced, CA, USA
متن کاملA threshold of lnn for approximating set
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max k-cover is the problem of selecting k subsets from F such that their union has maximum cardi-nality. Both these problems are NP-hard. We prove that (1 ? o(1)) ln n is a threshold below which set cover cannot be approximated eecien...
متن کاملA note on the generalized min-sum set cover problem
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin [1]. Bansal, Gupta, and Krishnaswamy [2] give a 485approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtai...
متن کامل